BIT-PARALLEL COMPUTATION OF LOCAL SIMILARITY SCORE MATRICES WITH UNITARY WEIGHTS
نویسندگان
چکیده
منابع مشابه
Bit-parallel computation of local similarity score matrices with unitary weights
Local similarity computation between two sequences permits detecting all the relevant alignments present between subsequences thereof. A well-known dynamic programming algorithm works in time O(mn), m and n being the lengths of the subsequences. The algorithm is rather slow when applied over many sequence pairs. In this paper we present the first bit-parallel computation of the score matrix, fo...
متن کاملBit - Parallel Computation of Lo al Similarity S ore Matri es with Unitary Weights
Abstra t. Lo al similarity omputation between two sequen es permits dete ting all the relevant alignments present between subsequen es thereof. A well-known dynami programming algorithm works in time O(mn), m and n being the lengths of the subsequen es. The algorithm is rather slow when applied over many sequen e pairs. In this paper we present the rst bit-parallel omputation of the s ore matri...
متن کاملBit - Parallel Computation of Lo al Similarity S ore Matri es with Unitary
Abstra t. Lo al similarity omputation between two sequen es permits dete ting all the relevant alignments present between subsequen es thereof. A well-known dynami programming algorithm works in time O(mn), m and n being the lengths of the subsequen es. The algorithm is rather slow when applied over many sequen e pairs. In this paper we present the rst bit-parallel omputation of the s ore matri...
متن کاملEigenvalue computation for unitary rank structured matrices
In this paper we describe how to compute the eigenvalues of a unitary rank structured matrix in two steps. First we perform a reduction of the given matrix into Hessenberg form, next we compute the eigenvalues of this resulting Hessenberg matrix via an implicit QR-algorithm. Along the way, we explainhow the knowledge of a certain ‘shift’ correction term to the structure can be used to speed up ...
متن کاملEigenvalues of the Sum of Matrices from Unitary Similarity Orbits
Abstract Let A and B be n×n complex matrices. Characterization is given for the set E(A,B) of eigenvalues of matrices of the form UAU + V BV for some unitary matrices U and V . Consequences of the results are discussed and computer algorithms and programs are designed to generate the set E(A,B). The results refine those of Wielandt on normal matrices. Extensions of the results to the sum of mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2006
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054106004443